- in a maximum of time in maximal time
- Математика: за максимальное время
Универсальный англо-русский словарь. Академик.ру. 2011.
in a maximum of time in maximal time
Смотреть что такое "in a maximum of time in maximal time" в других словарях:
Maximum life span — is a measure of the maximum amount of time one or more members of a population has been observed to survive between birth and death. Most living species have at least one upper limit on the number of times cells can divide. For humans, this is… … Wikipedia
Time-to-live — (Internet Protocol) (IP) Time to live oder TTL ist der Name eines Header Felds des Internetprotokolls, das verhindert, dass unzustellbare Pakete endlos lange von Router zu Router weitergeleitet werden. Das TTL Feld umfasst ein Oktett, kann also… … Deutsch Wikipedia
Time to live — (Internet Protocol) (IP) Time to live oder TTL ist der Name eines Header Felds des Internetprotokolls, das verhindert, dass unzustellbare Pakete endlos lange von Router zu Router weitergeleitet werden. Das TTL Feld umfasst ein Oktett, kann also… … Deutsch Wikipedia
Maximal independent set — This article is about the combinatorial aspects of maximal independent sets of vertices in a graph. For other aspects of independent vertex sets in graph theory, see Independent set (graph theory). For other kinds of independent sets, see… … Wikipedia
Maximum length sequence — A maximum length sequence (MLS) is a type of pseudorandom binary sequence. They are bit sequences generated using maximal linear feedback shift registers and are so called because they are periodic and reproduce every binary sequence that can be… … Wikipedia
Maximum entropy probability distribution — In statistics and information theory, a maximum entropy probability distribution is a probability distribution whose entropy is at least as great as that of all other members of a specified class of distributions. According to the principle of… … Wikipedia
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
Maximal cut — For a graph, a maximal cut is a cut with the size not smaller than the size of any other cut. The problem of finding a maximal cut is a graph is known as the max cut problem.Max cut problemThe max cut problem is one of Karp s 21 NP complete… … Wikipedia
Maximum spacing estimation — The maximum spacing method tries to find a distribution function such that the spacings, D(i), are all approximately of the same length. This is done by maximizing their geometric mean. In statistics, maximum spacing estimation (MSE or MSP), or… … Wikipedia
Maximum subarray problem — In computer science, the maximum subarray problem is the task of finding the contiguous subarray within a one dimensional array of numbers (containing at least one positive number) which has the largest sum. For example, for the sequence of… … Wikipedia
Maximum coverage problem — The maximum coverage problem is a classical question in computer science and computational complexity theory. It is a problem that is widely taught in approximation algorithms. As input you are given several sets and a number k. The sets may have … Wikipedia
